Splaying a search tree in preorder takes linear time
نویسندگان
چکیده
منابع مشابه
Concurrent Search Tree by Lazy Splaying
In many search tree (maps) applications the distribution of items accesses is non-uniform, with some popular items accessed more frequently than others. Traditional self-adjusting tree algorithms adapt to the access pattern, but are not suitable for a concurrent setting since they constantly move items to the tree’s root, turning the root into a sequential hot spot. Here we present lazy splayin...
متن کاملA Constant Update Time Finger Search Tree
Levcopolous and Overmars [L088] described a search tree in which the time to insert or delete a key was O( 1) once the position of the key to be inserted or deleted was known. Their data structure did not support fingers, pointers to points of high access or update activity in the set such that access and update operations in the vicinity of a finger are particularly efficient [GMPR77, BT80, Ko...
متن کاملA Randomized Linear-time Majority Tree Algorithm
We give a randomized linear-time algorithm for computing the majority tree, a technique widely used for summarizing sets of phylogenetic trees. We are implementing the algorithm as part of an interactive visualization system for analyzing large sets of
متن کاملA Linear-Time Majority Tree Algorithm
We give a randomized linear-time algorithm for computing the majority rule consensus tree. The majority rule tree is widely used for summarizing a set of phylogenetic trees, which is usually a postprocessing step in constructing a phylogeny. We are implementing the algorithm as part of an interactive visualization system for exploring distributions of trees, where speed is a serious concern for...
متن کاملA Linear Time Algorithm for Tree Mapping
Inconsistencies between a phylogenetic tree calculated from a set of related genes and known species phylogeny may be due to duplications events in the gene family under study. Tree Mapping attempts to pinpoint gene duplications in order to explain such discrepancies. The e ort in this explanation is measured using a tree mapping measure. Very little algorithmic work has so far been invested in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1990
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171290000254